Operator preconditioning with efficient applications for nonlinear elliptic problems

نویسنده

  • J. Karátson
چکیده

Nonlinear elliptic partial differential equations form a class of equations that is widespread in modelling various nonlinear phenomena in science, hence their numerical solution has continuously been a subject of extensive research. Such problems also arise from timedependent nonlinear PDE problems, either on the time levels after the time discretization or as describing steady-states of the process. The numerical study of elliptic PDEs has often relied on Hilbert space theory, since one can often incorporate the properties of the continuous PDE problem, from the Hilbert space in which it is posed, into the numerical procedure [3, 11, 13, 14, 25]. An approach that exploits Hilbert space theory is the idea of preconditioning operators, which was developed partly in the author’s papers and then put in general framework in the book [11]. A brief outline is given in [6]. Later this idea was applied again to further nonlinear models, and also coupled with mesh independence results of the author, see [8]. In this survey paper we briefly summarize the main lines of this theory with various applications. The common way of solving a nonlinear PDE is to discretize the problem, which leads to a nonlinear algebraic system normally of very large size, then a suitable iterative solver is applied. A main point here is the choice of suitable preconditioning. The idea of preconditioning operator means that the preconditioner is the projection of a preconditioning operator from the Sobolev space into the same discretization subspace as was used for the original nonlinear problem. In this way the properties of the original problem can be exploited more directly. An important measure of efficiency for an iterative solver is the optimality property, which requires that the computational cost should be of O(n) where n denotes the degrees of freedom in the algebraic system. This holds for some special linear PDE problems. These can then be used as preconditioners to more general problems via the preconditioning operator approach. Then a crucial property of the iteration is

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sobolev gradients: a nonlinear equivalent operator theory in preconditioned numerical methods for elliptic PDEs

Solution methods for nonlinear boundary value problems form one of the most important topics in applied mathematics and, similarly to linear equations, preconditioned iterative methods are the most efficient tools to solve such problems. For linear equations, the theory of equivalent operators in Hilbert space has proved an efficient organized framework for the study of preconditioners [6, 9], ...

متن کامل

Renormalized Solutions for Strongly Nonlinear Elliptic Problems with Lower Order Terms and Measure Data in Orlicz-Sobolev Spaces

The purpose of this paper is to prove the existence of a renormalized solution of perturbed elliptic problems$ -operatorname{div}Big(a(x,u,nabla u)+Phi(u) Big)+ g(x,u,nabla u) = mumbox{ in }Omega,  $ in the framework of Orlicz-Sobolev spaces without any restriction on the $M$ N-function of the Orlicz spaces, where $-operatorname{div}Big(a(x,u,nabla u)Big)$ is a Leray-Lions operator defined f...

متن کامل

Existence of at least three weak solutions for a quasilinear elliptic system

In this paper, applying two theorems of Ricceri and Bonanno, we will establish the existence of three weak solutions for a quasilinear elliptic system. Indeed, we will assign a differentiable nonlinear operator to a differential equation system such that the critical points of this operator are weak solutions of the system. In this paper, applying two theorems of R...

متن کامل

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

Domain decomposition preconditioning for elliptic problems with jumps in coefficients

In this paper, we propose an effective iterative preconditioning method to solve elliptic problems with jumps in coefficients. The algorithm is based on the additive Schwarz method (ASM). First, we consider a domain decomposition method without ‘cross points’ on interfaces between subdomains and the second is the ‘cross points’ case. In both cases the main computational cost is an implementatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011